An Encryption Algorithm Functioning on ASCII Values and Random Number Generation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Random Number Generation

Introduction Random numbers play a large and significant role in several fields and applications from cryptography to gaming to gambling. As a result, random number generators (RNGs) occupy a similarly important role. By their very nature, however, random numbers are difficult to fabricate, especially in the large quantities that they are often needed. In this paper I will discuss various topic...

متن کامل

On a decentralized trustless pseudo-random number generation algorithm

We construct an algorithm that permits a large group of individuals to reach consensus on a random number, without having to rely on any third parties. The algorithm works with high probability if there are less than 50% of colluding parties in the group. We describe also some modifications and generalizations of the algorithm.

متن کامل

Optimized random number generation in an interval

Article history: Received 17 January 2008 Available online 14 March 2009 Communicated by F. Dehne

متن کامل

Random Number Generation 1

Universit e de Montr eal 2 4.1 INTRODUCTION Random numbers are the nuts and bolts of simulation. Typically, all the randomness required by the model is simulated by a random number generator whose output is assumed to be a sequence of independent and identically distributed (IID) U(0; 1) random variables (i.e., continuous random variables distributed uniformly over the interval (0; 1)). These r...

متن کامل

Large Deviations Performance of Interval Algorithm for Random Number Generation

| We investigate large deviations performance of the interval algorithm for random number generation, especially for intrinsic randomness. First, we show that the length of output fair random bits per the length of input sequence approaches to the entropy of the source almost surely. Next, we consider to obtain the xed number of fair random bits from the input sequence with xed length. We show ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indian Journal of Science and Technology

سال: 2015

ISSN: 0974-5645,0974-6846

DOI: 10.17485/ijst/2015/v8i35/86673